FPT Algorithms for Domination in Biclique-Free Graphs
نویسندگان
چکیده
A class of graphs is said to be biclique-free if there is an integer t such that no graph in the class contains Kt,t as a subgraph. Large families of graph classes, such as any nowhere dense class of graphs or d-degenerate graphs, are biclique-free. We show that various domination problems are fixed-parameter tractable on biclique-free classes of graphs, when parameterizing by both solution size and t. In particular, the problems k-Dominating Set, Connected k-Dominating Set, Independent k-Dominating Set and Minimum Weight k-Dominating Set are shown to be FPT, when parameterized by t + k, on graphs not containing Kt,t as a subgraph. With the exception of Connected kDominating Set all described algorithms are trivially linear in the size of the input graph.
منابع مشابه
ROMAN DOMINATION: A Parameterized Perspective
We analyze the graph-theoretic formalization of Roman domination, dating back to the military strategy of Emperor Constantine, from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized algorithms are presented for graphs of bounded treewidth and for planar graphs. Moreover, it is shown that a parametric dual of Ro...
متن کاملStar and Biclique Coloring and Choosability
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G that contains no monochromatic maximal stars (bicliques). Similarly, for a list assignment L of G, a star (biclique) L-coloring is an L-coloring of G in which no maximal star (biclique) is monochromatic...
متن کاملOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملAlgorithms for induced biclique optimization problems
We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of intervalfilament graphs and complements of subtree-filament graphs. Such problems are to find maximum: induced bicliques, induced balanced bicliques and induced edge bicliques. These problems have applications for bicliqu...
متن کاملThe Parameterized Complexity of k-Biclique
Given a graph G and a parameter k, the k-biclique problem asks whether G contains a complete bipartite subgraph Kk,k. This is the most easily stated problem on graphs whose parameterized complexity is still unknown. We provide an fpt-reduction from k-clique to k-biclique, thus solving this longstanding open problem. Our reduction use a class of bipartite graphs with a threshold property of inde...
متن کامل